New Semantics for Hybrid Probabilistic Programs
نویسنده
چکیده
Hybrid probabilistic programs framework [5] is a variation of probabilistic annotated logic programming approach, which allows the user to explicitly encode the available knowledge about the dependency among the events in the program. In this paper, we extend the language of hybrid probabilistic programs by allowing disjunctive composition functions to be associated with heads of clauses and change its semantics to be more suitable for real-life applications. We show on a probabilistic AI planning example that the new semantics allows us to obtain more intuitive and accurate probabilities. The new semantics of hybrid probabilistic programs subsumes Lakshmanan and Sadri [17] framework of probabilistic logic programming. The fixpoint operator for the new semantics is guaranteed to be always continuous. This is not the case in the probabilistic annotated logic programming in general and the hybrid probabilistic programs framework in particular.
منابع مشابه
Non-monotonic Negation in Hybrid Probabilistic Logic Programs
In [23], a new Hybrid Probabilistic Logic Programs framework has been proposed, and a new semantics has been developed to enable encoding and reasoning about real-world applications. In this paper, the language of Hybrid Probabilistic Logic Programs framework of [23] is extended to allow non-monotonic negation, and two alternative semantics are defined: stable probabilistic model semantics and ...
متن کاملHybrid Probabilistic Logic Programs with Non-monotonic Negation
1 In [20], a new Hybrid Probabilistic Logic Programs framework is proposed, and a new semantics is developed to enable encoding and reasoning about real-world applications. In this paper, we extend the language of Hybrid Probabilistic Logic Programs framework in [20] to allow non-monotonic negation, and define two alternative semantics: stable probabilistic model semantics and probabilistic wel...
متن کاملQualitative and Quantitative Reasoning in Hybrid Probabilistic Logic Programs
Reasoning with qualitative and quantitative uncertainty is required in some real-world applications [6]. However, current extensions to logic programming with uncertainty support representing and reasoning with either qualitative or quantitative uncertainty. In this paper we extend the language of Hybrid Probabilistic Logic programs [28, 25], originally introduced for reasoning with quantitativ...
متن کاملHybrid Probabilistic Logic Programs as Residuated Logic Programs
In this paper we show the embedding of Hybrid Probabilistic Logic Programs into the rather general framework of Residuated Logic Programs, where the main results of (deenite) logic programming are validly extrapolated. The importance of this result is that for the rst time a framework encompassing several quite distinct logic programming more general semantical structure paving the way for deen...
متن کاملReinforcement Learning in Partially Observable Markov Decision Processes using Hybrid Probabilistic Logic Programs
We present a probabilistic logic programming framework to reinforcement learning, by integrating reinforcement learning, in POMDP environments, with normal hybrid probabilistic logic programs with probabilistic answer set semantics, that is capable of representing domain-specific knowledge. We formally prove the correctness of our approach. We show that the complexity of finding a policy for a ...
متن کامل